A family of ternary quasi-perfect BCH codes
نویسندگان
چکیده
In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.
منابع مشابه
A family of constacyclic ternary quasi-perfect codes with covering radius 3
In this paper a family of constacyclic ternary quasi-perfect linear block codes is presented. This family extends the result presented in a previous work by the first two authors, where the existence of codes with the presented parameters was stated as an open question. The codes have a minimum distance 5 and covering radius 3.
متن کاملBinary and ternary quasi-perfect codes with small dimensions
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of infinite families of QP codes which includes all binary, ternary and quaternary codes known to is. We continue further with a list of sporadic examples of binary ...
متن کاملNew Codes via the Lengthening of Bch Codes with Uep Codes
We describe a code lengthening technique that uses Unequal Error Protection codes as suux codes and combine it with iteration of the conventional Construction X. By applying this technique to BCH codes, we obtain 5 new binary codes, 13 new ternary codes and 13 new quaternary codes. An improvement of Construction XX yields 2 new ternary codes.
متن کاملOn the decoding of quasi-BCH codes
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can ...
متن کاملNarrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over GF(q) with length n = (qm−1)/(q−1). Little is known about ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 49 شماره
صفحات -
تاریخ انتشار 2008